Section: Software

Malleable minWCT

Participants : Nicolas Bonichon [correspondant] , Olivier Beaumont, Lionel Eyraud-Dubois.

This applet considers the scheduling of malleable tasks with bounded amount of processing resources. The goal is to compute schedules that minimize the weighted completion time of tasks. The applet generates all possible greedy schedules for a given instance and displays only the best ones.

This applet illustrates the complexity of finding an optimal order of tasks [31] .

See also the web page http://www.labri.fr/perso/bonichon/malleable

Software assessment : A-2, SO-1, SM-2, EM-1, SDL-2.